A Simple One Sweep Algorithm for Optimal
نویسندگان
چکیده
| Soft-input/soft-output symbol decoding plays a signiicant role in iterative decoding. We propose a simple optimal soft-input/soft-output symbol decoding algorithm for linear block codes which requires one forward recursion using a trellis. For many codes the decoding complexity is lower than previous methods, such as the algorithm by Bahl et. al. 1], and the decrease is shown at its most when decoding Hamming codes.
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملAbout One Sweep Algorithm for Solving Linear-Quadratic Optimization Problem with Unseparated Two-Point Boundary Conditions
In the paper a linear-quadratic optimization problem (LCTOR) with unseparated two-point boundary conditions is considered. To solve this problem is proposed a new sweep algorithm which increases doubles the dimension of the original system. In contrast to the well-known methods, here it refuses to solve linear matrix and nonlinear Riccati equations, since the solution of such multi-point optimi...
متن کاملOptimal Placement and Sizing of Distributed Generation Via an Improved Nondominated Sorting Genetic Algorithm II
The use of distributed generation units in distribution networks has attracted the attention of network managers due to its great benefits. In this research, the location and determination of the capacity of distributed generation (DG) units for different purposes has been studied simultaneously. The multi-objective functions in the optimization model are reducing system line losses; reducing v...
متن کاملSolving the vehicle routing problem by a hybrid meta-heuristic algorithm
The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the to...
متن کاملAn Optimum Algorithm for Single Machine with Early/Tardy Cost
The problem of determining the sequence of a set of jobs with the objective function of minimizing the maximum earliness and tardiness in one machine is studied. 
 Production systems like JIT are one of the many applications of the problem. This problem is studied in special cases and their optimal solutions are introduced with simple orders. In general, some effective conditions for ne...
متن کامل